Effective Replicated Server Allocation Algorithms in Mobile Computing Systems

In mobile environments, mobile device users access and transfer a great deal of data through the online servers. In order to enhance users’ access speed in a wireless network, decentralizing replicated servers appropriately in the network is required. Previous work regarding this issue had focused on the placement of replicated servers along with the moving paths of the users to maximize the hit ratio. When a miss occurs, they simply ignored the file request. Therefore, we suggest a solution to take care of such a miss by sending a file request to a replicated server nearby in the network. This paper is to propose new cost-effective wireless access algorithms incorporating a present replicated server allocation algorithm with more keen analysis of the moving patterns of mobile device users. We propose four different algorithms that allocate available replicated servers in the network so as to minimize the communication costs. The experimental results show that, among the proposed algorithms, the replicated server clustering algorithm allocated replicated servers with near optimal communication costs.